A worthy family of semisymmetric graphs
نویسنده
چکیده
In this paper, we construct semisymmetric graphs in which no two vertices have exactly the same neighbors. We show how to do this by /rst considering bi-transitive graphs, and then we show how to choose two such graphs so that their product is regular. We display a family of bi-transitive graphs DN (a; b) which can be used for this purpose and we show that their products are semisymmetric by applying vectors due to Ivanov. c © 2003 Elsevier B.V. All rights reserved.
منابع مشابه
Affine Primitive Groups and Semisymmetric Graphs
In this paper, we investigate semisymmetric graphs which arise from affine primitive permutation groups. We give a characterization of such graphs, and then construct an infinite family of semisymmetric graphs which contains the Gray graph as the third smallest member. Then, as a consequence, we obtain a factorization of the complete bipartite graph Kpspt ,psp into connected semisymmetric graph...
متن کاملAn infinite family of biprimitive semisymmetric graphs
A regular and edge transitive graph which is not vertex transitive is said to be semisymmetric Every semisymmetric graph is necessarily bipartite with the two parts having equal size and the automorphism group acting transitively on each of these two parts A semisymmet ric graph is called biprimitive if its automorphism group acts prim itively on each part In this paper a classi cation of bipri...
متن کاملCubic Semisymmetric Graphs of Order 2p 3 Semisymmetric Graphs of Order 2p 3
A regular graph is called semisymmetric if it is edge-transitive but not vertex-transitive. It is proved that the Gray graph is the only cubic semisymmetric graph of order 2p3, where p 3 is a prime.
متن کاملG-graphs: An efficient tool for constructing symmetric and semisymmetric graphs
Symmetric and semisymmetric graphs are used in many scientific domains, especially parallel computation and interconnection networks. The industry and the research world make a huge usage of such graphs. Constructing symmetric and semisymmetric graphs is a large and hard problem. In this paper a tool called G-graphs and based on group theory is used. We show the efficiency of this tool for cons...
متن کاملSemisymmetric Cubic Graphs Constructed from Bi-Cayley Graphs of An
For a group T and a subset S of T , the bi-Cayley graph BCay(T, S) of T with respect to S is the bipartite graph with vertex set T×{0, 1} and edge set {{(g, 0), (sg, 1)} | g ∈ T, s ∈ S}. In this paper, we investigate cubic bi-Cayley graphs of finite nonabelian simple groups. We give several sufficient or necessary conditions for a bi-Cayley graph to be semisymmetric, and construct several infin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 271 شماره
صفحات -
تاریخ انتشار 2003